Fully Indecomposable Exponents of Primitive Matrices
نویسندگان
چکیده
If A is a primitive matrix, then there is a smallest power of A (its fully indecomposable exponent) that is fully indecomposable, and a smallest power of A (its strict fully indecomposable exponent) starting from which all powers are fully indecomposable. We obtain bounds on these two exponents.
منابع مشابه
An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace
This research memorandum is aimed at presenting an alternative proof to a well known theorem that an indecomposable nonnegative matrix with at least one positive diagonal element is primitive. Our proof is half topological and half combinatorial.
متن کاملOn the Gaps in the Set of Exponents of Boolean Primitive Circulant
In this paper we consider the problem of describing the possible exponents of boolean primitive circulant matrices. We give a conjecture for the possible such exponents and prove this conjecture in several cases. In particular, we consider in greater detail the case of matrices whose generating vector has three nonzero entries.
متن کاملMatrices and α-Stable Bipartite Graphs
A square (0, 1)-matrix X of order n ≥ 1 is called fully indecomposable if there exists no integer k with 1 ≤ k ≤ n− 1, such that X has a k by n− k zero submatrix. The reduced adjacency matrix of a bipartite graph G = (A,B,E) (having A ∪ B = {a1, ..., am} ∪ {b1, ..., bn} as vertex set, and E as edge set), is X = [xij ], 1 ≤ i ≤ m, 1 ≤ j ≤ n, where xij = 1 if aibj ∈ E and xij = 0 otherwise. A sta...
متن کاملDistribution of the exponents of primitive circulant matrices in the first four boxes of Zn
In this paper we consider the problem of describing the possible exponents of n-by-n Boolean primitive circulant matrices. It is well known that this set is a subset of [1, n− 1] and not all integers in [1, n− 1] are attainable exponents. In the literature, some attention has been paid to the gaps in the set of exponents. The first three gaps have been proven, that is, the integers in the inter...
متن کاملThe Concepts of Irreducibility and Full Indecomposability of a Matrix in the Works of Frobenius, K6nig and Markov
Frobenius published two proofs of a theorem which characterizes irreducible and fully indecomposable matrices in an algebraic manner. It is shown that the second proof, which depends on the Frobenius-Konig theorem, yields a stronger form of the result than the first. Some curious features in Frobenius’s last paper are examined; these include his criticisms of a result due to D. K&rig and the la...
متن کامل